Fundraising September 15, 2024 – October 1, 2024 About fundraising
4

AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem

Year:
1998
Language:
english
File:
PDF, 130 KB
english, 1998
5

Computing shortest paths with uncertainty

Year:
2007
Language:
english
File:
PDF, 192 KB
english, 2007
6

Clustering to minimize the sum of cluster diameters

Year:
2004
Language:
english
File:
PDF, 338 KB
english, 2004
7

Combining request scheduling with web caching

Year:
2004
Language:
english
File:
PDF, 268 KB
english, 2004
8

A combinatorial algorithm for max csp

Year:
2003
Language:
english
File:
PDF, 128 KB
english, 2003
9

A note on optical routing on trees

Year:
1997
Language:
english
File:
PDF, 521 KB
english, 1997
10

Computing the Median with Uncertainty

Year:
2003
Language:
english
File:
PDF, 146 KB
english, 2003
11

Lower Bounds on Locality Sensitive Hashing

Year:
2008
Language:
english
File:
PDF, 151 KB
english, 2008
13

Spamming botnets

Year:
2008
Language:
english
File:
PDF, 735 KB
english, 2008
27

Estimating PageRank on graph streams

Year:
2011
Language:
english
File:
PDF, 202 KB
english, 2011